Magic Inference Rules for Probabilistic Deduction under Taxonomic Knowledge
نویسنده
چکیده
We present locally complete inference rules for probabilistic deduction from taxonomic and probabilistic knowledge-bases over conjunctive events. Crucially, in contrast to similar inference rules in the literature, our inference rules are locally complete for conjunctive events and under additional taxonomic knowledge. We discover that our inference rules are extremely complex and that it is at first glance not clear at all where the deduced tightest bounds come from. Moreover, analyzing the global completeness of our inference rules, we find examples of globally very incomplete probabilistic deductions. More generally, we even show that all systems of inference rules for taxonomic and probabilistic knowledge-bases over conjunctive events are globally incomplete. We conclude that probabilistic deduction by the iterative application of inference rules on interval restrictions for conditional probabilities, even though considered very promising in the literature so far, seems very limited in its field of application.
منابع مشابه
An Episodic Knowledge Representation for Narrative Texts
We would like to build story understanding systems which are transparent, modular, and extensible. To this end, we have been working on a new logical approach to narrative understanding that features a GPSG-style grammar and an episodic logic with probabilistic inference rules. The grammar represents phrase structure and the relationship between phrase structure and logical form in a modular, e...
متن کاملTractable Query Answering Under Probabilistic Constraints
Large knowledge bases such as YAGO [SKW07] or DBpedia [BLK+09] can be used to answer queries in various domains. However, as they are automatically harvested from Web sources, they may be incomplete: important facts may be missing because they were not materialized in the original sources, or could not be extracted correctly. To mitigate this problem, approaches such as association rule mining ...
متن کاملConditional Deduction Under Uncertainty
Conditional deduction in binary logic basically consists of deriving new statements from an existing set of statements and conditional rules. Modus Ponens, which is the classical example of a conditional deduction rule, expresses a conditional relationship between an antecedent and a consequent. A generalisation of Modus Ponens to probabilities in the form of probabilistic conditional inference...
متن کاملA Temporal-Probabilistic Database Model for Information Extraction
Temporal annotations of facts are a key component both for building a high-accuracy knowledge base and for answering queries over the resulting temporal knowledge base with high precision and recall. In this paper, we present a temporalprobabilistic database model for cleaning uncertain temporal facts obtained from information extraction methods. Specifically, we consider a combination of tempo...
متن کاملAutomatic derivation of probabilistic inference rules
A probabilistic inference rule is a general rule that provides bounds on a target probability given constraints on a number of input probabilities. Example: from P (AjB) r infer P (:AjB) 2 [1 r; 1℄. Rules of this kind have been studied extensively as a deduction method for propositional probabilistic logics. Many different rules have been proposed, and their validity proved – often with substan...
متن کامل